K-maximin clustering: a maximin correlation approach to partition-based clustering
نویسندگان
چکیده
منابع مشابه
K-maximin clustering: a maximin correlation approach to partition-based clustering
We propose a new clustering algorithm based upon the maximin correlation analysis (MCA), a learning technique that can minimize the maximum misclassification risk. The proposed algorithm resembles conventional partition clustering algorithms such as k-means in that data objects are partitioned into k disjoint partitions. On the other hand, the proposed approach is unique in that an MCA-based ap...
متن کاملMaximin Separation Probability Clustering
This paper proposes a new approach for discriminative clustering. The intuition is, for a good clustering, one should be able to learn a classifier from the clustering labels with high generalization accuracy. Thus we define a novel metric to evaluate the quality of a clustering labeling, named Minimum Separation Probability (MSP), which is a lower bound of the generalization accuracy of a clas...
متن کاملMaximin Correlation
This paper is concerned with the problem of finding a vector from a given set in a Euclidean space that maximizes the worst-case correlation with vectors in this set, where ‘worst’ means smallest. This problem, called the maximin correlation problem (MCP), comes up in several disciplines including pattern classification, portfolio selection, statistics, and signal processing. With a general inf...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملPartition Selection Approach for Hierarchical Clustering Based on Clustering Ensemble
Hierarchical clustering algorithms are widely used in many fields of investigation. They provide a hierarchy of partitions of the same dataset. However, in many practical problems, the selection of a representative level (partition) in the hierarchy is needed. The classical approach to do so is by using a cluster validity index to select the best partition according to the criterion imposed by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2009
ISSN: 1349-2543
DOI: 10.1587/elex.6.1205